A note on the maximum flow through a network
نویسندگان
چکیده
-This note discusses the problem of maximizing the rate of flow from one terminal to another, through a network which consists of a number of branches, each of which has a !imited capacity. The main result is a theorem: The maximum possible flow from left to right through a network is equal to the minimum value among all simple cut-sets. This theorem is applied to solve a more general problem, in which a number of input nodes and a number of output nodes are used.
منابع مشابه
A Note on the Integrality Gap in the Nodal Interdiction Problem
In the maximum flow network interdiction problem, an attacker attempts to minimize the maximum flow by interdicting flow on the arcs of network. In this paper, our focus is on the nodal interdiction for network instead of the arc interdiction. Two path inequalities for the node-only interdiction problem are represented. It has been proved that the integrality gap of relaxation of the maximum fl...
متن کاملOscillatory MHD Flow of Blood through an Artery with Mild Stenosis (RESEARCH NOTE)
The purpose of this work is to study the effect of oscillatory MHD blood flow in stenosed artery. The analytical and numerical results are obtained for oscillatory MHD blood flow, which is assumed to be a Newtonian fluid. It was also assumed that the surface roughness is of cosine shaped and the maximum height of roughness is negligible, compared with the radius of un-constricted tube. The flui...
متن کاملRelationship between Pedestrians’ Speed, Density and Flow Rate of Crossings through Urban Intersections (Case Study: Rasht Metropolis) (RESEARCH NOTE)
Travels within the city are done in different ways, by vehicle or on foot. Thus, inevitably, a part of the travel is always done on foot. Since intersections as traffic nodes are determinant factor in transportation network capacity, any disruption in them leads to severe reduction in network capacity. Unfortunately, pedestrian behavior has received little attention in Iran. While this is a ver...
متن کاملInverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance
Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...
متن کاملA Mathematical Model for Blood Flow Through Narrow Vessels with Mild-Stenosis (RESEARCH NOTE)
In this paper we examine the effect of mild stenosis on blood flow, in an irregular axisymmetric artery with oscillating pressure gradient. The Herschel-Bulkley fluid model has been utilized for this study. The combined influence of an asymmetric shape and surface irregularities of constriction has been explored in this computational study. An extensive quantitative analysis has been performed ...
متن کاملCooperative network flow problem with pricing decisions and allocation of benefits: A game theory approach
Several real problems in telecommunication, transportation, and distribution industries can be well analyzed by network flow models. In revenue management, pricing plays a primary role which increases the profit generated from a limited supply of assets. Pricing decision directly affects the amount of service or product demand. Hence, in traditional maximum flow problem, we assume that the dema...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IRE Trans. Information Theory
دوره 2 شماره
صفحات -
تاریخ انتشار 1956